The reconstruction conjecture and edge ideals
نویسندگان
چکیده
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection of subgraphs obtained by removing a vertex from G. These properties include the Krull dimension, the Hilbert function, and all the graded Betti numbers i,j where j <n. We also state many further questions that arise from our study. © 2007 Elsevier B.V. All rights reserved. MSC: 05C60; 13F55
منابع مشابه
Multiplicity Bounds for Quadratic Monomial Ideals
We prove the multiplicity bounds conjectured by Herzog-HunekeSrinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of forests, and the weaker Taylor bound conjecture for all quadratic monomial ideals. We determine when equality holds in the conjectured bound, and verify that when equality holds, the resolution is pure. We characterize forests that have C...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملRegularity of second power of edge ideals
Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.
متن کاملAn upper bound for the regularity of powers of edge ideals
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008